Asymptotically optimal interruptible service policies for scheduling jobs in a diffusion regime with nondegenerate slowdown
نویسندگان
چکیده
A parallel server system is considered, with I customer classes and many servers, operating at a heavy traffic diffusion regime where the queueing delay and service time are of the same order of magnitude. Denoting by X̂ and Q̂ the diffusion scale deviation of the headcount process from the quantity corresponding to the underlying fluid model and, respectively, the diffusion scale queue-length, we consider minimizing r.v.’s of the form cX = ∫ u 0 C(X̂(t))dt and cQ = ∫ u 0 C(Q̂(t))dt over policies that allow for service interruption. Here, C : R → R+ is continuous and u > 0. Denoting by θ the so called workload vector, it is assumed that C∗(w) := min{C(q) : q ∈ R+, θ · q = w} is attained along a continuous curve as w varies in R+. We show that any weak limit point of cX stochastically dominates the r.v. ∫ u 0 C∗(W (t))dt for a suitable reflected Brownian motion W , and construct a sequence of policies that asymptotically achieve this lower bound. For cQ, an analogous result is proved when, in addition, C ∗ is convex. The construction of the policies takes full advantage of the fact that in this regime the number of servers is of the same order as the typical queue-length.
منابع مشابه
Scheduling Parallel Servers in the Nondegenerate Slowdown Diffusion Regime: Asymptotic Optimality Results1 by Rami Atar
We consider the problem of minimizing queue-length costs in a system with heterogenous parallel servers, operating in a many-server heavy-traffic regime with nondegenerate slowdown. This regime is distinct from the wellstudied heavy traffic diffusion regimes, namely the (single server) conventional regime and the (many-server) Halfin–Whitt regime. It has the distinguishing property that waiting...
متن کاملScheduling parallel servers in the non - degenerate slowdown diffusion regime : Asymptotic optimality results ∗
We consider the problem of minimizing queue-length costs in a system with heterogenous parallel servers, operating in a many-server heavy-traffic regime with non-degenerate slowdown. This regime is distinct from the well-studied heavy traffic diffusion regimes, namely the (single server) conventional regime and the (many-server) Halfin-Whitt regime. It has the distinguishing property that waiti...
متن کاملScheduling Control for Queueing Systems with Many Servers: Asymptotic Optimality in Heavy Traffic1 by Rami Atar
A multiclass queueing system is considered, with heterogeneous service stations, each consisting of many servers with identical capabilities. An optimal control problem is formulated, where the control corresponds to scheduling and routing, and the cost is a cumulative discounted functional of the system’s state. We examine two versions of the problem: “nonpreemptive,” where service is uninterr...
متن کاملDynamic Scheduling of a Parallel Server System in Heavy Traffic with Complete Resource Pooling: Asymptotic Optimality of a Threshold Policy
We consider a parallel server queueing system consisting of a bank of buffers for holding incoming jobs and a bank of flexible servers for processing these jobs. Incoming jobs are classified into one of several different classes (or buffers). Jobs within a class are processed on a first-in-first-out basis, where the processing of a given job may be performed by any server from a given (class-de...
متن کاملLoad Balancing in the Non-Degenerate Slowdown Regime
We analyse Join-the-Shortest-Queue in a contemporary scaling regime known as the Non-Degenerate Slowdown regime. Join-the-Shortest-Queue (JSQ) is a classical load balancing policy for queueing systems with multiple parallel servers. Parallel server queueing systems are regularly analysed and dimensioned by diffusion approximations achieved in the Halfin-Whitt scaling regime. However, when jobs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 69 شماره
صفحات -
تاریخ انتشار 2011